A Volume Problem (M. K. Lewis)

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal covering location-allocation problem with M/M/k queuing system and side constraints

  We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...

متن کامل

The (m,k)-patch boundary code problem

A simple (non overlapping) region of the hexagonal tessellation of the plane is uniquely determined by its boundary. This seems also to be true for “regions” that curve around and have a simple overlap. However, Guo, Hansen and Zheng [3] constructed a pair of non isomorphic (self-overlapping) regions of the hexagonal tessellation which have the same boundary. These regions overlapped themselves...

متن کامل

ABS-Type Methods for Solving $m$ Linear Equations in $frac{m}{k}$ Steps for $k=1,2,cdots,m$

‎The ABS methods‎, ‎introduced by Abaffy‎, ‎Broyden and Spedicato‎, ‎are‎‎direct iteration methods for solving a linear system where the‎‎$i$-th iteration satisfies the first $i$ equations‎, ‎therefore a‎ ‎system of $m$ equations is solved in at most $m$ steps‎. ‎In this‎‎paper‎, ‎we introduce a class of ABS-type methods for solving a full row‎‎rank linear equations‎, ‎w...

متن کامل

Algorithms for the m-Coverage Problem and k-Connected m-Coverage Problem in Wireless Sensor Networks

Abstract. An important issue in deploying a wireless sensor network (WSN) is to provide target coverage with high energy efficiency and faulttolerance. In this paper, we study the problem of constructing energy-efficient and fault-tolerant target coverage with the minimal number of active nodes which form an m-coverage for targets and a k-connected communication subgraph. We propose two heurist...

متن کامل

Spotlights: [M+.Crown.Y-] as a reagent (M+= K+, NO+; Y-= Br3-, I3-, H(NO3)2)

Fateme Derakhshan-Panah was born in Hamedan (Iran) in 1987. She received her B.S. in Pure Chemistry (2009) and M.S. in Organic Chemistry (2011) from Bu-Ali Sina University, Iran. She is currently working towards her Ph.D. under the supervision of Professor M. A. Zolfigol. Her research interest is organic methodology especially the application of solid acids and ionic liquids in organic synthesis.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Review

سال: 1983

ISSN: 0036-1445,1095-7200

DOI: 10.1137/1025014